Linear codes over finite rings are trace codes
نویسندگان
چکیده
منابع مشابه
Linear Codes over Finite Rings
Linear codes over finite rings with identity have recently raised a great interest for their new role in algebraic coding theory and for their successful application in combined coding and modulation. Thus, in this paper we address the problems of constructing of new cyclic, BCH, alternant, Goppa and Srivastava codes over local finite commutative rings with identity. These constructions are ver...
متن کاملLinear Codes over Finite Chain Rings
The aim of this paper is to develop a theory of linear codes over finite chain rings from a geometric viewpoint. Generalizing a well-known result for linear codes over fields, we prove that there exists a one-to-one correspondence between so-called fat linear codes over chain rings and multisets of points in projective Hjelmslev geometries, in the sense that semilinearly isomorphic codes corres...
متن کاملQuantum Codes from Linear Codes over Finite Chain Rings
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-ShorSteane (CSS) construction applied to self-dual codes over finite chain rings. The second construction is derived from the CSS construction applied to Gray images of the linear codes over finite chain ring Fp2m + uFp2m. The good parameter...
متن کاملCyclic codes over finite rings
It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x"-1 in F[x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite tings and proves the above characterization to be true for a large class of such codes over these rings. (~) 1997 Elsevier Science B.V. All rights...
متن کاملGalois Correspondence on Linear Codes over Finite Chain Rings
GivenS|R a finite Galois extension of finite chain rings andB anS-linear code we define twoGalois operators, the closure operator and the interior operator. We proof that a linear code is Galois invariant if and only if the row standard form of its generator matrix has all entries in the fixed ring by the Galois group and show a Galois correspondence in the class of S-linear codes. As applicati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111919